On Euler’s Conjecture
نویسنده
چکیده
Let X ≤ 1. Recently, there has been much interest in the classification of combinatorially Desargues, Cavalieri, naturally right-geometric subgroups. We show that n is not smaller than c. A useful survey of the subject can be found in [3, 27]. Next, in this context, the results of [11] are highly relevant.
منابع مشابه
Multiplicative Relations in Powers of Euler’s Product
In a recent paper, Cooper and Hirschhorn conjecture relations among the coefficients of certain products of powers of Euler’s product. Here we use the theory of modular forms with complex multiplication to prove these conjectures.
متن کاملNotes on the Rigidity of Graphs
The first reference to the rigidity of frameworks in the mathematical literature occurs in a problem posed by Euler in 1776, see [8]. Consider a polyhedron P in 3-space. We view P as a ‘ panel-and-hinge framework’ in which the faces are 2-dimensional panels and the edges are 1-dimensional hinges. The panels are free to move continuously in 3-space, subject to the constraints that the shapes of ...
متن کاملThe Ringing of Euler’s Disk
The motion of disks spun on tables has the well-known feature that the associated acoustic signal increases in frequency as the motion tends towards its abrupt halt. Recently, a commercial toy, known as Euler’s disk, was designed to maximize the time before this abrupt ending. In this paper, we present and simulate a rigid body model for Euler’s disk. Based on the nature of the contact force be...
متن کاملSets of Monotonicity for Euler’s Totient Function
We study subsets of [1, x] on which the Euler φ-function is monotone (nondecreasing or nonincreasing). For example, we show that for any > 0, every such subset has size < x, once x > x0( ). This confirms a conjecture of the second author.
متن کاملThe number of solutions of φ ( x ) =
An old conjecture of Sierpiński asserts that for every integer k > 2, there is a number m for which the equation φ(x) = m has exactly k solutions. Here φ is Euler’s totient function. In 1961, Schinzel deduced this conjecture from his Hypothesis H. The purpose of this paper is to present an unconditional proof of Sierpiński’s conjecture. The proof uses many results from sieve theory, in particul...
متن کاملON COMMON VALUES OF φ(n) AND σ(m), I
We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x/(log x) numbers not exceeding x common to the ranges of φ and σ. Here φ is Euler’s totient function and σ is the sum-of-divisors function.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014